Two combinatorial problems in group theory

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Open problems in combinatorial group theory

This is a collection of open problems in combinatorial group theory, which is based on a similar list available on-line at our web site http://zebra.sci.ccny.cuny.edu/web/ In selecting the problems, our choices have been, in part, determined by our own tastes. In view of this, we have welcomed suggestions from other members of the community. We want to emphasize that many people have contribute...

متن کامل

certain combinatorial topics in group theory

this article is intended to be a survey on some combinatorial topics in group theory. the bibliography at the end is neither claimed to be exhaustive, nor is it necessarily connected with a reference in the text. i include it as i see it revolves around the concepts which are discussed in the text.

متن کامل

Combinatorial Group Theory

An early version of these notes was prepared for use by the participants in the Workshop on Algebra, Geometry and Topology held at the Australian National University, 22 January to 9 February, 1996. They have subsequently been updated and expanded many times for use by students in the subject 620-421 Combinatorial Group Theory at the University of Melbourne. Copyright 1996-2004 by C. F. Miller ...

متن کامل

On two combinatorial problems arising from automata theory

We present some partial results on the following conjectures arising from automata theory. The first conjecture is the triangle conjecture due to Perrin and Schützenberger. Let A = {a, b} be a two-letter alphabet, d a positive integer and let Bd = {a ba | 0 6 i + j 6 d}. If X ⊂ Bd is a code, then |X| 6 d + 1. The second conjecture is due to Černý and the author. Let A be an automaton with n sta...

متن کامل

Smart elements in combinatorial group testing problems

In combinatorial group testing problems the questioner needs to find a special element x ∈ [n] by testing subsets of [n]. Tapolcai et al. [27, 28] introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the special one. Using classical results of extremal set theory we prove that if Fn ⊆ 2 solves the nonadaptive v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 1972

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa-21-1-111-116